Set Covering, Packing and Partitioning Problems
نویسندگان
چکیده
where A is a mxn matrix of zeroes and ones, e = (1,...,1) is a vector of m ones and c is a vector of n (arbitrary) rational components. This pure 0-1 linear programming problem is called the set covering problem. When the inequalities are replaced by equations the problem is called the set partitioning problem, and when all of the ≥ constraints are replaced by ≤ constraints, the problem is called the set packing problem.
منابع مشابه
Some Results on facets for linear inequality in 0-1 variables
The facet of Knapsack ploytope, i.e. convex hull of 0-1 points satisfying a given linear inequality has been presented in this current paper. Such type of facets plays an important role in set covering set partitioning, matroidal-intersection vertex- packing, generalized assignment and other combinatorial problems. Strong covers for facets of Knapsack ploytope has been developed in the first pa...
متن کاملRelations among Some Combinatorial Programs
This paper investigates relations among combinatorial optimization problems. To establish such relations we introduce a transformation technique |aggregation| that allows to relax an integer program by means of another integer program. We prove that various families of prominent inequalities for the acyclic subdigraph problem, the multiple knapsack problem, the max cut, graph, and the clique pa...
متن کاملRelations Among Some Combinatorial ProgramsRalf
This paper investigates relations among combinatorial optimization problems. To establish such relations we introduce a transformation technique |aggregation| that allows to relax an integer program by means of another integer program. We prove that various families of prominent inequalities for the acyclic subdigraph problem, the multiple knapsack problem, the max cut, graph, and the clique pa...
متن کاملOn the family of 0/1-polytopes with NP-complete non-adjacency relation
In 1995 T. Matsui considered a special family 0/1-polytopes for which the problem of recognizing the non-adjacency of two arbitrary vertices is NP-complete. In 2012 the author of this paper established that all the polytopes of this family are present as faces in the polytopes associated with the following NP-complete problems: the traveling salesman problem, the 3-satisfiability problem, the k...
متن کاملPacking, Partitioning, and Covering Symresacks
In this paper, we consider symmetric binary programs that contain set packing, partitioning, or covering (ppc) inequalities. To handle symmetries as well as ppc-constraints simultaneously, we introduce constrained symresacks which are the convex hull of all binary points that are lexicographically not smaller than their image w.r.t. a coordinate permutation and which fulfill some ppc-constraint...
متن کامل